Parallel Nonnegative Least Squares Solvers for Model Order Reduction
نویسنده
چکیده
منابع مشابه
A Projected Alternating Least square Approach for Computation of Nonnegative Matrix Factorization
Nonnegative matrix factorization (NMF) is a common method in data mining that have been used in different applications as a dimension reduction, classification or clustering method. Methods in alternating least square (ALS) approach usually used to solve this non-convex minimization problem. At each step of ALS algorithms two convex least square problems should be solved, which causes high com...
متن کاملFast Nonnegative Least Squares Through Flexible Krylov Subspaces
Constrained least squares problems arise in a variety of applications, and many iterative methods are already available to compute their solutions. This paper proposes a new efficient approach to solve nonnegative linear least squares problems. The associated KKT conditions are leveraged to form an adaptively preconditioned linear system, which is then solved by a flexible Krylov subspace metho...
متن کاملDSANLS: Accelerating Distributed Nonnegative Matrix Factorization via Sketching Technical Report
Nonnegative matrix factorization (NMF) has been successfully applied in di erent elds, such as text mining, image processing, and video analysis. NMF is the problem of determining two nonnegative low rank matrices U and V , for a given input matrix M , such that M ≈ UV >. There is an increasing interest in parallel and distributed NMF algorithms, due to the high cost of centralized NMF on large...
متن کاملNesterov-based Alternating Optimization for Nonnegative Tensor Factorization: Algorithm and Parallel Implementations
We consider the problem of nonnegative tensor factorization. Our aim is to derive an efficient algorithm that is also suitable for parallel implementation. We adopt the alternating optimization (AO) framework and solve each matrix nonnegative least-squares problem via a Nesterov-type algorithm for strongly convex problems. We describe two parallel implementations of the algorithm, with and with...
متن کاملMassively Parallel Solver for the High-Order Galerkin Least-Squares Method
A high-order Galerkin Least-Squares (GLS) finite element discretization is combined with massively parallel implicit solvers. The stabilization parameter of the GLS discretization is modified to improve the resolution characteristics and the condition number for the high-order interpolation. The Balancing Domain Decomposition by Constraints (BDDC) algorithm is applied to the linear systems aris...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016